Intuitive Pathfinding of Autonomous Agents

نویسنده

  • Carsten Hahn
چکیده

This paper treats the pathfinding of autonomous agents from a given start point to a set of targets. It mainly focuses on continuous domains with continuous state and action spaces of the agents. In these continuous domains a technique called Cross Entropy Online Planning can be deployed by the agents to plan and assess sequences of actions in order to reach their goals. However, this technique requires a simulation model of the environment to enable the agents to predict and evaluate future states of the environment. This could be combined with results of the field of Intuitive Physics which tries to create models for simple physical object interactions based merely on observations. The contribution of this work is the idea to replace the simulation model in Online Planning with results of the field of Intuitive Physics in order to create Intuitive Acting Autonomous Agents. The benefit of this will be the automated creation of the otherwise manually created model and an enhancement of the flexibility

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-agent RRT: sampling-based cooperative pathfinding

Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, such as autonomous aircrafts, cars, or underwater vehicles. The state-of-the-art algorithms for cooperative pathfinding for embodied robots typically rely on some heuristic forward-search pathfinding technique, where A...

متن کامل

Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding

Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous und...

متن کامل

Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)

Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, such as autonomous aircrafts, cars, or underwater vehicles. The state-of-the-art algorithms for cooperative pathfinding typically rely on some heuristic forward-search pathfinding technique, where A* is often the algor...

متن کامل

Tractable Massively Multi-Agent Pathfinding with Solution Quality and Completeness Guarantees

Pathfinding is an important underlying task for autonomous agents such as mobile robots, computer game characters, and aircrafts on airport taxiways. Abstracting the environment into a navigation graph enables a mobile unit to use heuristic search, such as A*, to plan a path to its goal. When multiple units move simultaneously inside the shared space, the solution also involves navigating every...

متن کامل

Massively multi-agent pathfinding made tractable, efficient, and with completeness guarantees

Pathfinding is an important underlying task for many autonomous agents. Abstracting the environment into a navigation graph (e.g., a grid map) enables a mobile unit to plan its path to goal using heuristic search. For example, an A* search finds an optimal path. With multiple units moving simultaneously inside a shared space, the goal is to navigate each unit to its target without colliding int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017